Preconditioned Descent Algorithms for p-Laplacian

In this paper, we examine some computational issues on finite element discretization of the p-Laplacian. We introduced a class of descent methods with multi-grid finite element preconditioners, and carried out convergence analysis. We showed that their convergence rate is mesh-independent. We studied the behavior of the algorithms with large p. Our numerical tests show that these algorithms are able to solve large scale p-Laplacian with very large p. The algorithms are then used to solve a variational inequality. Subject Classification: 49J20, 65N30.